منابع مشابه
MuST: The Multilevel Sinc Transform
A fast multilevel algorithm (MuST) for evaluating an n-sample sinc interpolant at mn points is presented. For uniform grids, its complexity is 25mn log(1/δ) flops for the sinc kernel and 75mn log(1/δ) for the sincd kernel, where δ is the target evaluation accuracy. MuST is faster than FFTand FMM-based evaluations for large n and/or for large δ. It is also applicable to non-uniform grids and to ...
متن کاملIntegrating the Curriculum Why We Must Transform
"^"^ Then today's students complete %/%/ their schooling, many of them T T will be functionally illiterate, unprepared to participate in or guide our scienceand technology-oriented soci ety. This situation, though bleak, is hardly surprising. More than 200 national reports on science education have described the current curriculum as obsolete. "In a great many cases, precollege education in the...
متن کاملQuantum fast Fourier transform using multilevel atoms
We propose an implementation of the quantum fast Fourier transform algorithm in an entangled system of multilevel atoms. The Fourier transform occurs naturally in the unitary time evolution of energy eigenstates and is used to de®ne an alternative wave-packet basis for quantum information in the atom. A change of basis from energy levels to wave packets amounts to a discrete quantum Fourier tra...
متن کاملError estimates with explicit constants for Sinc approximation, Sinc quadrature and Sinc indefinite integration
Error estimates with explicit constants are given for approximations of functions, definite integrals and indefinite integrals by means of the Sinc approximation. Although in the literature various estimates have already been given for these approximations, they were basically for examining the rates of convergence, and several constants were left unevaluated. Giving more explicit estimates, i....
متن کاملTHE FAST SINC TRANSFORM AND IMAGE RECONSTRUCTION FROM NONUNIFORM SAMPLES IN k-SPACE
A number of problems in image reconstruction and image processing can be addressed, in principle, using the sinc kernel. Since the sinc kernel decays slowly, however, it is generally avoided in favor of some more local but less precise choice. In this paper, we describe the fast sinc transform, an algorithm which computes the convolution of arbitrarily spaced data with the sinc kernel in O.N lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2011
ISSN: 1064-8275,1095-7197
DOI: 10.1137/100806904